import bisect

n = int(input())
nums = list(map(int, input().split()))
nums.sort()
ans = []
for k in range(1, n + 1):
    cnt = 0
    i = 0
    while i < n:
        cnt += 1
        i = bisect.bisect_left(nums, nums[i] + k)
    ans.append(str(cnt))
print(" ".join(ans))
